A Greedy Clustering Algorithm for Multiple Sequence Alignment
نویسندگان
چکیده
منابع مشابه
Parallel Sequence Alignment Algorithm for Clustering System
Sequence alignment is one of the most important fundamental operations in bioinformatics. It has been successfully applied to predict the function, structure and evolution of biological sequences. In this paper, the sequence alignment algorithms based on dynamic programming are analyzed and compared. We present a parallel algorithm for pairwise alignment and implement it on a clustering system ...
متن کاملBetter Greedy Sequence Clustering with Fast Banded Alignment
Comparing a string to a large set of sequences is a key subroutine in greedy heuristics for clustering genomic data. Clustering 16S rRNA gene sequences into operational taxonomic units (OTUs) is a common method used in studying microbial communities. We present a new approach to greedy clustering using a trie-like data structure and Four Russians speedup. We evaluate the running time of our met...
متن کاملAuto-Poietic Algorithm for Multiple Sequence Alignment
The concept of self-organization is applied to the operators and parameters of genetic algorithm to develop a novel Auto-poietic algorithm solving a biological problem, Multiple Sequence Alignment (MSA). The self-organizing crossover operator of the developed algorithm undergoes a swap and shuffle process to alter the genes of chromosomes in order to produce better combinations. Unlike Standard...
متن کاملMultiple sequence alignment with hierarchical clustering.
An algorithm is presented for the multiple alignment of sequences, either proteins or nucleic acids, that is both accurate and easy to use on microcomputers. The approach is based on the conventional dynamic-programming method of pairwise alignment. Initially, a hierarchical clustering of the sequences is performed using the matrix of the pairwise alignment scores. The closest sequences are ali...
متن کاملAn Efficient Progressive Alignment Algorithm for Multiple Sequence Alignment
Analyzing and comparing the string representations of sequences reveals a lot of useful information about the sequences. As new biological sequences are being generated at exponential rates, sequence comparison is becoming increasingly important to draw functional and evolutionary inference of proteins. This paper presents a partitioning approach for biomolecular sequence alignment that signifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Cognitive Informatics and Natural Intelligence
سال: 2021
ISSN: 1557-3958,1557-3966
DOI: 10.4018/ijcini.20211001.oa41